S heduling of Equal - Length Jobs : Randomization and Restarts
نویسنده
چکیده
منابع مشابه
Online S heduling of Equal-Length Jobs: Randomization and Restarts Help
We consider the following scheduling problem. The input is a set of jobs with equal processing times, where each job is specified by its release time and deadline. The goal is to determine a single-processor, non-preemptive schedule of these jobs that maximizes the number of completed jobs. In the online version, each job arrives at its release time. We give two online algorithms with competiti...
متن کاملOnline Scheduling of Equal-Length Jobs: Randomization and Restarts Help
We consider the following scheduling problem. The input is a set of jobs with equal processing times, where each job is specified by its release time and deadline. The goal is to determine a single-processor, non-preemptive schedule that maximizes the number of completed jobs. In the online version, each job arrives at its release time. We give two online algorithms with competitive ratios belo...
متن کاملA simpler competitive analysis for scheduling equal-length jobs on one machine with restarts
We consider the online problem of scheduling jobs with equal processing times on a single machine. Each job has a release time and a deadline, and the goal is to maximize the number of jobs completed by their deadlines. Chrobak et al. (2007, SICOMP 36:6) introduce a preempt-restart model in which progress toward completing a preempted job is lost, yet that job can be restarted from scratch. The...
متن کاملOnline scheduling in a parallel batch processing system to minimize makespan using restarts
We consider an online scheduling problem in a parallel batch processing system with jobs in a batch being allowed to restart. Online means that jobs arrive over time, and all jobs’ characteristics are unknown before their arrival times. A parallel batch processing machine can handle up to several jobs simultaneously. All jobs in a batch start and complete at the same time. The processing time o...
متن کاملA unifying onservation law for single-server queues
Urtzi Ayesta LAAS-CNRS 7, Avenue Colonel Ro he 31077, Toulouse e-mail: urtzi laas.fr Abstra t We develop a onservation law for a multilass GI/GI/1 queue operating under a general workonserving s heduling dis ipline. For singlelass single-server queues, onservation laws have been obtained for both non-anti ipating and anti ipating dis iplines with general servi e time distributions. For multilas...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004